A new finiteness condition for monoids presented by complete rewriting systems ( after Craig

نویسندگان

  • Craig C. Squier
  • Yves LAFONT
  • Robert Cremanns
چکیده

Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely presentable monoid has no presentation by means of a finite complete rewriting system. A similar result was already obtained by the same author using homology, but the new method is more direct and more powerful. Here, we present Squier’s argument with a bit of categorical machinery, making proofs shorter and easier. In addition we prove that, if a monoid has finite derivation type, then its third homology group is of finite type. An invariant for a structure is something which can be calculated in many ways, but only depends on the structure itself. Typical examples are the dimension of a vector space or the genus of a surface. Squier’s finiteness condition for monoids is of this kind: It can be defined in terms of a finite presentation, but does not depend on the choice of this presentation. To begin with a simpler case, consider the following theorem, which is not hard to prove: If M is a finitely presentable monoid, Σ a finite alphabet and φ a surjective morphism from the free monoid Σ∗ to M , then the congruence on Σ∗ induced by φ is generated by some finite set R ⊂ Σ∗×Σ∗. In other words, the existence of a finite presentation for M does not depend on the choice of the set of generators, provided it is finite. The invariance of Squier’s finiteness condition is of the same nature, but it is a 2-dimensional word problem in the sense of [Bu]. Therefore, we have to introduce a little more algebraic material (sections 1–2) before we get to the heart of the matter (sections 3–6). With this geometrical viewpoint, the connection with homology becomes quite natural (section 7). I am grateful to Volker Diekert for pointing out the preprint of Squier, and to Friedrich Otto for the bibliographical references. Theorem 3 has been proved independently by Robert Cremanns and Friedrich Otto [CrOt]. ∗Address: 163 avenue de Luminy, case 930, 13288 MARSEILLE CEDEX 9, FRANCE.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Polygraphic Survey on Finiteness Conditions for Rewriting Systems

In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he has constructed finitely presented decidable monoids that cannot be presented by finite convergent rewriting systems. In 1994, Squier introduced the condition of finite derivation type, which is a h...

متن کامل

Polygraphs of finite derivation type

Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a decidable word problem, but that cannot be presented by finite convergent rewriting systems. Later, he introduced the condition of finite derivation type, whic...

متن کامل

Crystal bases, finite complete rewriting systems, and biautomatic structures for Plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$

This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...

متن کامل

Crystal bases , finite complete rewriting systems , and

This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...

متن کامل

Higher-dimensional normalisation strategies for acyclicity

We introduce acyclic polygraphs, a notion of complete categorical cellular model for (small) categories, containing generators, relations and higher-dimensional globular syzygies. We give a rewriting method to construct explicit acyclic polygraphs from convergent presentations. For that, we introduce higher-dimensional normalisation strategies, defined as homotopically coherent ways to relate e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994